Highly Efficient Arithmetic Coding for Bi-Level Images.
نویسندگان
چکیده
منابع مشابه
Lossy/Lossless Coding of Bi-level Images
We present improvements to a general type of lossless, lossy, and refinement coding of bi-level images [a]. Loss is introduced by flipping pixels. The pixels are coded using arithmetic coding (either QM-coding or that of [l]) of conditional probabilities obtained using a template as is known from JBIG and proposed in JBIG-2 [2]. Our new state-of-the-art results are obtained using the more gener...
متن کاملAdaptive Progressive Coding for Compression of Bi-level Video Images
In video compression, progressive coding plays an important role in terms of coding efficiency and error resilience and has been an attractive research topic since the standardization of H.264/AVC. In this paper, we propose a high-performance progressive coding scheme with the help of bi-level images. Different from progressive H.264/AVC and other video standards, we construct image epitomes as...
متن کاملEfficient algorithm for obtaining connected components in bi-level images
We propose an efficient method for labeling connected components in bi-level images. The proposed algorithm uses a Deterministic Finite Automaton to obtain chain codes and label component boundaries, and use a tracing technique that is simpler than existing methods. Experiments on various types of images show that the proposed method improves contour tracing efficiency.
متن کاملFast Adaptive Encoder for Bi-Level Images
We present a new bi-level image compression coder that does not use arithmetic encoding, but whose performance is close to that of state-of-the-art coders such as JBIG, JBIG-2, and JB2. The proposed bi-level coder (BLC) uses two simple adaptation rules: the first to compute context-dependent probability estimates that control a pixel prediction module, and the second to adjust a run-length para...
متن کاملError resilient arithmetic coding of still images
This paper examines the use of arithmetic coding in conjunction with the error resilient entropy code (EREC). The constraints on the coding model are discussed and simulation results are presented and compared to those obtained using Huffman coding. These results show that without the EREC, arithmetic coding is less resilient than Huffman coding, while with the EREC both systems yield comparabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Institute of Television Engineers of Japan
سال: 1995
ISSN: 0386-6831,1884-9652
DOI: 10.3169/itej1978.49.46